Reconfigurable Mesh Algorithms for the Hough Transform

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Algorithms for the Hough Transform on Arrays with Reconfigurable Optical Buses

This paper examines the possibility of implementing the Hough transform for line and circle detection on arrays with reconfigurable optical buses (AROBs). It is shown that the Hough transform for line and circle detection in an N N image can be implemented in a constant number of steps. The costs of the two algorithms are O(Np) and O(Np), respectively, where p is the magnitude of one dimension ...

متن کامل

Constant-Time Hough Transform on a 3D Reconfigurable Mesh Using Fewer Processors

The Hough transform has many applications in image processing and computer vision, including line detection, shape recognition and range alignment for moving imaging objects. Many constant-time algorithms for computing the Hough transform have been proposed on recon gurable meshes [1, 5, 6, 7, 9, 10]. Among them, the ones described in [1, 10] are the most e cient. For a problem with an N N imag...

متن کامل

Generation Algorithms Of Fast Generalized Hough Transform

In this paper we investigate the problem of finding the minimal operations number for the generalized Hough transform computation (GHT). We demonstrate that this problem is equivalent to the addition chain problem and is therefore NP-complete. Three greedy methods for generating GHT computation algorithms are proposed and their performance is compared against the fast Hough transform (FHT) for ...

متن کامل

High-speed Parameterisable Hough Transform Using Reconfigurable Hardware

Recent developments in reconfigurable hardware technologies have offered high-density high-speed devices with the ability for custom computing whilst maintaining the flexibility of a software solution. These features are well suited to image processing algorithms that are computationally intensive and repetitive in nature. Very deep pipelining and parallelism, features often required for real t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Parallel and Distributed Computing

سال: 1994

ISSN: 0743-7315

DOI: 10.1006/jpdc.1994.1006